#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m, k;
pii a[N];
map<pii, int> id;
int f[N], ff[N];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
void init() { rep(i, 1, k) f[i] = i; }
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
void merge(int x, int y) {
  int fx = find(x), fy = find(y);
  if (fx == fy) return;
  f[fy] = fx;
  ff[fx] |= ff[fy];
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m >> k;
  init();
  rep(i, 1, k) {
    cin >> a[i].first >> a[i].second;
    id[a[i]] = i;
    int x = a[i].first, y = a[i].second;
    if (x == 1) ff[i] |= 1;
    if (x == n) ff[i] |= 2;
    if (y == 1) ff[i] |= 4;
    if (y == m) ff[i] |= 8;
    rep(dx, -1, 1) rep(dy, -1, 1) {
      int nx = x + dx, ny = y + dy;
      if (nx < 1 || nx > n || ny < 1 || ny > m) continue;
      if (id.count(pii(nx, ny))) {
        merge(id[pii(nx, ny)], i);
      }
    }
  }
  rep(i, 1, k) {
    if (f[i] == i) {
      if ((ff[i] & 3) == 3 || (ff[i] & 12) == 12 || (ff[i] & 5) == 5 ||
          (ff[i] & 10) == 10) {
        cout << "No";
        return 0;
      }
    }
  }
  cout << "Yes";
  return 0;
}